Argument Filtering Transformation
نویسندگان
چکیده
To simplify the task of proving termination of term rewriting systems, several elimination methods, such as the dummy elimination, the distribution elimination, the general dummy elimination and the improved general dummy elimination, have been proposed. In this paper, we show that the argument ltering method combining with the dependency pair technique is essential in all the above elimination methods. We present remarkable simple proofs for the soundness of these elimination methods based on this observation. Moreover, we propose a new elimination method, called the argument ltering transformation, which is not only more powerful than all the other elimination methods but also especially useful to make clear the essential relation hidden behind these methods.
منابع مشابه
Termination , AC - Termination and Dependency Pairs of Term Rewriting Systems
Recently, Arts and Giesl introduced the notion of dependency pairs, which gives effective methods for proving termination of term rewriting systems (TRSs). In this thesis, we extend the notion of dependency pairs to AC-TRSs, and introduce new methods for effectively proving AC-termination. Since it is impossible to directly apply the notion of dependency pairs to AC-TRSs, we introduce the head ...
متن کاملStatic Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques
A static dependency pair method, proposed by us, can effectively prove termination of simply-typed term rewriting systems (STRSs). The theoretical basis is given by the notion of strong computability. This method analyzes a static recursive structure based on definition dependency. By solving suitable constraints generated by the analysis result, we can prove the termination. Since this method ...
متن کاملRedundant Argument Filtering of Logic Programs
This paper is concerned with the problem of removing, from a given logic program, redundant arguments. These are arguments which can be removed without affecting correctness. Most program specialisation techniques, even through they perform argument filtering and redundant clause removal, fail to remove a substantial number of redundant arguments, yielding in some cases rather inefficient resid...
متن کامل1 Constraints for Argument Filterings ?
Argument filterings are a key ingredient of the dependency pair method. Finding a suitable argument filtering that enables the constraints originating from the dependency pair method to be solved by a strictly monotone base order is a challenging search problem. In Section 1.2 we propose a simple encoding of argument filterings in propositional logic which can be easily combined with propositio...
متن کاملHigher-Order Path Orders Based on Computability
Simply-typed term rewriting systems (STRSs) are an extension of term rewriting systems. STRSs can be naturally handle higher order functions, which are widely used in existing functional programming languages. In this paper we design recursive and lexicographic path orders, which can efficiently prove the termination of STRSs. Moreover we discuss an application to the dependency pair and the ar...
متن کامل